Accounting Mechanisms for Distributed Work Systems.

Hybrid transitive trust mechanisms.

Hardware%2Dassisted middleware Acceleration of garbage collection operations.

Recommendation based on object typicality.

Recommendation based on object typicality.

Understanding retweeting behaviors in social networks.

Identifying new categories in community question answering archives a topic modeling approach.

Combining link and content for collective active learning.



Driver fatigue detection algorithm based on eye features.

Parameterized maneuver learning for autonomous helicopter flight.

TyCo Towards Typicality%2Dbased Collaborative Filtering Recommendation.

Mining advisor%2Dadvisee relationships from research publication networks.

Social action tracking via noise tolerant time%2Dvarying factor graphs.
Users’behaviors(actions)inasocialnetworkareinfluencedbyvarious factors such as personal interests, social influence, and global trends. However, few publications systematicallystudy how social actions evolve in a dynamic social network and towhat extent different factors affect the user actions. In this paper, we propose a Noise Tolerant Time-varying Factor Graph Model (NTT-FGM) for modeling and predicting social actions. NTT-FGM simultaneously models social network structure, user attributes and user action history for better prediction of the users ’ future actions. More specifically, a user’s action at time t is generated by her latent state at t, which is influenced by her attributes,herownlatentstateattimet−1andherneighbors’ states attimetandt−1. Basedonthisintuition,weformalizethe social action tracking problem using the NTT-FGM model; then present an efficient algorithm to learn the model, by combining the ideas from both continuous linear system and Markov random field. Finally, we present a case study of our model on predicting future social actions. We validate the model on three different types ofreal-worlddatasets. Qualitatively,ourmodelcandiscover interestingpatternsofthesocialdynamics. Quantitatively,experimental resultsshowthattheproposedmethodoutperformsseveralbaseline methods for social actionprediction. Categories andSubject Descriptors
Mining advisor%2Dadvisee relationships from research publication networks.

Modeling the evolution of associated data.

A constraint%2Dbased topic modeling approach for name disambiguation.

Proceedings of the 2nd ACM Workshop on Social Web Search and Mining

Topic%2DLevel Random Walk through Probabilistic Model.

Query%2DFocused Summarization by Combining Topic Model and Affinity Propagation.

Heterogeneous cross domain ranking in latent space.

A tag recommendation system for folksonomy.

Topic Distributions over Links on Web.
Abstract—It is well known that Web users create links with different intentions. However, a key question, which is not well studied, is how to categorize the links and how to quantify the strength of the influence of a web page on another if there is a link between the two linked web pages. In this paper, we focus on the problem of link semantics analysis, and propose a novel supervised learning approach to build a model, based on a training link-labeled and link-weighted graph where a link-label represents the category of a link and a link-weight represents the influence of one web page on the other in a link. Based on the model built, we categorize links and quantify the influence of web pages on the others in a large graph in the same application domain. We discuss our proposed approach, namely Pairwise Restricted Boltzmann Machines (PRBMs), and conduct extensive experimental studies to demonstrate the effectiveness of our approach using large real datasets. I.
The Fuzzy PI Control for the DSTATCOM Based on the Balance of Instantaneous Power.

Towards Ontology Learning from Folksonomies.
A folksonomy refers to a collection of user-defined tags with which users describe contents published on the Web. With the flourish of Web 2.0, folksonomies have become an important mean to develop the Semantic Web. Because tags in folksonomies are authored freely, there is a need to understand the structure and semantics of these tags in various applications. In this paper, we propose a learning approach to create an ontology that captures the hierarchical semantic structure of folksonomies. Our experimental results on two different genres of real world data sets show that our method can effectively learn the ontology structure from the folksonomies. 1


Social influence analysis in large%2Dscale networks.

RiMOM Results for OAEI 2009.
Abstract. In this report, we give a brief explanation of how RiMOM obtains the results at OAEI 2009 Campaign, especially in the new Instance Matching track. At first, we show the basic alignment process of RiMOM and different alignment strategies in RiMOM. Then we give new features in instance matching compared with traditional ontology matching (schema matching) and introduce the specific techniques we used for the 3 different subtracks of Instance Matching Track. At last we give some comments on our results and discuss some future work about RiMOM. 1 Presentation of the system Ontology matching is the key technology to reach interoperability over ontologies. In recent years, much research work has been conducted for finding the alignment of ontologies[1]. Many automatic matching algorithms achieves good results in real world data. With the development of Linked Data[2], huge amount of semantic data are available through the web. Thus instance matching, a special branch of ontology matching, draws lots of research interest recent years.
A Discriminative Approach to Topic%2DBased Citation Recommendation.
Abstract. In this paper, we present a study of a novel problem, i.e. topic-based citation recommendation, which involves recommending papers to be referred to. Traditionally, this problem is usually treated as an engineering issue and dealt with using heuristics. This paper gives a formalization of topic-based citation recommendation and proposes a discriminative approach to this problem. Specifically, it proposes a two-layer Restricted Boltzmann Machine model, called RBM-CS, which can discover topic distributions of paper content and citation relationship simultaneously. Experimental results demonstrate that RBM-CS can significantly outperform baseline methods for citation recommendation. 1
The Stable Conditions of a Task%2DPair with Helper%2DThread in CMP.

Multi%2Dtopic Based Query%2DOriented Summarization.

A gauss function based approach for unbalanced ontology matching.

Discovering the staring people from social networks.

RiMOM A Dynamic Multistrategy Ontology Alignment Framework.

Academic conference homepage understanding using constrained hierarchical conditional random fields.
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks- labeling conference function pages, function blocks, and attributes. Different from traditional information extraction tasks, the data in academic conference homepages has complex structural dependencies across multiple Web pages. In addition, there are logical constraints in the data. In this paper, we propose a unified approach, Constrained Hierarchical Conditional Random Fields, to accomplish the three labeling tasks simultaneously. In this approach, complex structural dependencies can be well described. Also, the constrained Viterbi algorithm in the inference process can avoid logical errors. Experimental results on real world conference data have demonstrated that this approach performs better than cascaded labeling methods by 3.6 % in F1-measure and that the constrained inference process can improve the accuracy by 14.3%. Based on the proposed approach, we develop a prototype system of useoriented semantic academic conference calendar. The user simply needs to specify what conferences he/she is interested in. Subsequently, the system finds, extracts, and updates the semantic information from the Web, and then builds a calendar automatically for the user. The semantic conference data can be used in other applications, such as finding sponsors and finding experts. The proposed approach can be used in other information extraction tasks as well.
A Topic Modeling Approach and Its Integration into the Random Walk Framework for Academic Search.
In this paper, we propose a unified topic modeling approach and its integration into the random walk framework for academic search. Specifically, we present a topic model for simultaneously modeling papers, authors, and publication venues. We combine the proposed topic model into the random walk framework. Experimental results show that our proposed approach for academic search significantly outperforms the baseline methods of using BM25 and language model, and those of using the existing topic models (including pLSI, LDA, and the AT model). 1
User Profile Management for Personalized Telecom Service.

ArnetMiner extraction and mining of academic social networks.
This paper addresses several key issues in the ArnetMiner system, which aims at extracting and mining academic social networks. Specifically, the system focuses on: 1) Extracting researcher profiles automatically from the Web; 2) Integrating the publication data into the network from existing digital libraries; 3) Modeling the entire academic network; and 4) Providing search services for the academic network. So far, 448,470 researcher profiles have been extracted using a unified tagging approach. We integrate publications from online Web databases and propose a probabilistic framework to deal with the name ambiguity problem. Furthermore, we propose a unified modeling approach to simultaneously model topical aspects of papers, authors, and publication venues. Search services such as expertise search and people association search have been provided based on the modeling results. In this paper, we describe the architecture and main features of the system. We also present the empirical evaluation of the proposed methods.
RiMOM Results for OAEI 2008.
Workshop chairs Melliyal Annamalai (Oracle, USA) Daniel Olmedilla (Leibniz Universität Hannover, DE)
A Mixture Model for Expert Finding.
Abstract. This paper addresses the issue of identifying persons with expertise knowledge on a given topic. Traditional methods usually estimate the relevance between the query and the support documents of candidate experts using, for example, a language model. However, the language model lacks the ability of identifying semantic knowledge, thus results in some right experts cannot be found due to not occurrence of the query terms in the support documents. In this paper, we propose a mixture model based on Probabilistic Latent Semantic Analysis (PLSA) to estimate a hidden semantic theme layer between the terms and the support documents. The hidden themes are used to capture the semantic relevance between the query and the experts. We evaluate our mixture model in a real-world system, ArnetMiner 1. Experimental results indicate that the proposed model outperforms the language models. 1
Expertise Search in a Time%2DVarying Social Network.

Name Disambiguation Using Atomic Clusters.

Recommendation over a Heterogeneous Social Network.
With the Web content having been changed from homogeneity to heterogeneity, the recommendation becomes a more challenging issue. In this paper, we have investigated the recommendation problem on a general heterogeneous Web social network. We categorize the recommendation needs on it into two main scenarios: recommendation when a person is doing a search and recommendation when the person is browsing the information. We formalize the recommendation as a ranking problem over the heterogeneous network. Moreover, we propose using a random walk model to simultaneously ranking different types of objects and propose a pair-wise learning algorithm to learn the weight of each type of relationship in the model. Experimental results on two real-world data sets show that improvements can be obtained by comparing with the baseline methods. 1.
Name Disambiguation Using Atomic Clusters.

Path Similarity Based Directory Ontology Matching.

Extraction and mining of an academic social network.
This paper addresses several key issues in extraction and mining of an academic social network: 1) extraction of a researcher social network from the existing Web; 2) integration of the publications from existing digital libraries; 3) expertise search on a given topic; and 4) association search between researchers. We developed a social network system, called ArnetMiner, based on proposed methods to the above problems. In total, 448,470 researcher profiles and 981,599 publications were extracted/integrated after the system having been in operation for two years. The paper describes the architecture and main features of the system. It also briefly presents the experimental results of the proposed methods.
A unified framework for name disambiguation.
Name ambiguity problem has been a challenging issue for a long history. In this paper, we intend to make a thorough investigation of the whole problem. Specifically, we formalize the name disambiguation problem in a unified framework. The framework can incorporate both attribute and relationship into a probabilistic model. We explore a dynamic approach for automatically estimating the person number K and employ an adaptive distance measure to estimate the distance between objects. Experimental results show that our proposed framework can significantly outperform the baseline method.
WWW 2008 workshop on social web search and mining SWSM2008.

Arnetminer expertise oriented search using social networks.

A Unified Tagging Approach to Text Normalization.

A constraint%2Dbased probabilistic framework for name disambiguation.

Verification of Web Service Conversations Specified in WSCL.

Expert Finding in a Social Network.
Abstract. This paper addresses the issue of expert finding in a social network. The task of expert finding, as one of the most important research issues in social networks, is aimed at identifying persons with relevant expertise or experience for a given topic. In this paper, we propose a propagation-based approach that takes into consideration of both person local information and network information (e.g. relationships between persons). Experimental results show that our approach can outperform the baseline approach. 1.
Social Network Extraction of Academic Researchers.
This paper addresses the issue of extraction of an academic researcher social network. By researcher social network extraction, we are aimed at finding, extracting, and fusing the ‘semantic’-based profiling information of a researcher from the Web. Previously, social network extraction was often undertaken separately in an ad-hoc fashion. This paper first gives a formalization of the entire problem. Specifically, it identifies the ‘relevant documents ’ from the Web by a classifier. It then proposes a unified approach to perform the researcher profiling using Conditional Random Fields (CRF). It integrates publications from the existing bibliography datasets. In the integration, it proposes a constraints-based probabilistic model to name disambiguation. Experimental results on an online system show that the unified approach to researcher profiling significantly outperforms the baseline methods of using rule learning or classification. Experimental results also indicate that our method to name disambiguation performs better than the baseline method using unsupervised learning. The methods have been applied to expert finding. Experiments show that the accuracy of expert finding can be significantly improved by using the proposed methods. 1.
Result of Ontology Alignment with RiMOM at OAEIpos%3B07.

ArnetMiner An Expertise Oriented Search System for Web Community.
Abstract. Expertise Oriented Search aims at providing comprehensive analysis and mining for people from distributed sources. In this paper, we give an overview of the expertise oriented search system (ArnetMiner). The system addresses several key research issues in extraction and mining of a researcher social network. The system is in operation on the internet for more than one year and receives accesses from about 1,500 users per month. Feedbacks from users and system logs indicate that users consider the system can really help people to find and share information in the web community. 1.
EOS expertise oriented search using social networks.

A Unified Approach to Researcher Profiling.
Abstract. Expertise Oriented Search aims at providing comprehensive analysis and mining for people from distributed sources. In this paper, we give an overview of the expertise oriented search system (ArnetMiner). The system addresses several key research issues in extraction and mining of a researcher social network. The system is in operation on the internet for more than one year and receives accesses from about 1,500 users per month. Feedbacks from users and system logs indicate that users consider the system can really help people to find and share information in the web community. 1.
Enhancing Semantic Web by Semantic Annotation Experiences in Building an Automatic Conference Calendar.


Semantic Similarity Based Ontology Cache.

Weighted Ontology%2DBased Search Exploiting Semantic Similarity.


Semantic Annotation Using Horizontal and Vertical Contexts.

Content%2DBased 3D Model Retrieval for Digital Museum.

Subdivision Interpolating Polygonization of Implicit Surfaces with Normal Meshes.

Tree%2DStructured Conditional Random Fields for Semantic Annotation.
Abstract. The large volume of web content needs to be annotated by ontologies (called Semantic Annotation), and our empirical study shows that strong dependencies exist across different types of information (it means that identification of one kind of information can be used for identifying the other kind of information). Conditional Random Fields (CRFs) are the state-of-the-art approaches for modeling the dependencies to do better annotation. However, as information on a Web page is not necessarily linearly laid-out, the previous linear-chain CRFs have their limitations in semantic annotation. This paper is concerned with semantic annotation on hierarchically dependent data (hierarchical semantic annotation). We propose a Tree-structured Conditional Random Field (TCRF) model to better incorporate dependencies across the hierarchically laid-out information. Methods for performing the tasks of model-parameter estimation and annotation in TCRFs have been proposed. Experimental results indicate that the proposed TCRFs for hierarchical semantic annotation can significantly outperform the existing linear-chain CRF model. 1.
Result of Ontology Alignment with RiMOM at OAEI%2706.

SWARMS A New Tool for Domain Exploration in Semantic Web.

Keyword Extraction Using Support Vector Machine.
In this paper we present a new version of OntoGen system for semi-automatic data-driven ontology construction. The system is based on a novel ontology learning framework which formalizes and extends the role of machine learning and text mining algorithms used in the previous version. List of new features includes extended number of supported ontology formats (RDFS and OWL), supervised methods for concept discovery (based on Active Learning), adding of new instances to ontology and improved user interface (based on comments from the users). 1
Using Bayesian decision for ontology mapping.
Ontology mapping is the key point to reach interoperability over ontologies. In semantic web environment, ontologies are usually distributed and heterogeneous and thus it is necessary to find the mapping between them before processing across them. Many efforts have been conducted to automate the discovery of ontology mapping. However, some problems are still evident. In this paper, ontology mapping is formalized as a problem of decision making. In this way, discovery of optimal mapping is cast as finding the decision with minimal risk. An approach called Risk Minimization based Ontology Mapping (RiMOM) is proposed, which automates the process of discoveries on 1:1, n:1, 1:null and null:1 mappings. Based on the techniques of normalization and NLP, the problem of instance heterogeneity in ontology mapping is resolved to a certain extent. To deal with the problem of name conflict in mapping process, we use thesaurus and statistical technique. Experimental results indicate that the proposed method can significantly outperform the baseline methods, and also obtains improvement over the existing methods. © 2006 Elsevier B.V. All rights reserved.
Anisotropic Feature%2DPreserving Smoothing of 3D Mesh.

Feature%2DCorrelation Based Multi%2Dview Detection.

Email data cleaning.
Many researchers have applied statistical analysis techniques to email for classification purposes, such as identifying spam messages. Such approaches can be highly effective, however many examine incoming email exclusively — which does not provide detailed information about an individual user’s behavior. Only by analyzing outgoing messages can a user’s behavior be ascertained. Our contributions are: the use of empirical analysis to select an optimum, novel collection of behavioral features of a user’s email traffic that enables the rapid detection of abnormal email activity; and a demonstration of the effectiveness of outgoing email analysis using an application that detects worm propagation. 1
Multiple strategies detection in ontology mapping.

Association search in semantic web search   inference.
Association search is to search for certain instances in semantic web and then make inferences from and about the instances we have found. In this paper, we propose the problem of association search and our preliminary solution for it using Bayesian network. We first minutely define the association search and its categorization. We then define tasks in association search. In terms of Bayesian network, we take ontology taxonomy as network structure in Bayesian network. We use the query log of instances to estimate the network parameters. After the Bayesian network is constructed, we give the solution for association search in the network.
Rebuild of King Fang 40 BC musical scales by He%27s inequality.

iASA Learning to Annotate the Semantic Web.

Loss Minimization Based Keyword Distillation.


Semantic Based Web Services Discovery.

A Component Retrieval Method Based on Facet%2DWeight Self%2Dlearning.


Keyword Extraction Based Peer Clustering.

Using DAML OIL to Enhance Search Semantic.

Research of Satisfying Atomic and Anonymous Electronic Commerce Protocol.

Research of Atomic and Anonymous Electronic Commerce Protocol.

